Identificación y conteo de parásitos gastrointestinales en ovinos dorper, en Atlapexco, Hidalgo, México
نویسندگان
چکیده
El objetivo fue identificar y contar la población de nematodos gastrointestinales (NGI) en un centro producción ovina Atlapexco, Se realizó estudio coprológico mediante técnica McMaster, a 42 ovinos raza Dorper, los meses septiembre noviembre 2017. efectuó estadística descriptiva las variables evaluadas (identificación conteo NGI, edad animales) con el STATISTICA® V 7.1. Los géneros helmintos encontrados fueron Trichostrongylus spp., Trichurys spp. Moniezia encontró que mayores 12 presentaron mayor carga parásitos, cual 4742.8, mientras menor 6 tuvieron 3800.0 NGI 6-11 2561.1 NGI. La identificación número presentes nos permitirán tomar decisiones preventivas para reducir cargas parasitarias Dorper.
منابع مشابه
Identificación y Evaluación de los Factores de Desarrollo para Sistemas de Información para Dispositivos Móviles en México
conscientemente los factores encontrados es la más aceptada.
متن کاملIdentificación de entidades con nombre basada en modelos de Markov y árboles de decisión
In this paper we investigate Named Entity Recognition (NER) systems using two well-known classifiers in the machine learning literature: Markov Models and Decision Trees. We have designed several systems to check the impact of introducing different characteristics which have a weak dependence of the language used. We also report the results obtained by our systems on the Spanish corpus provided...
متن کاملExperiencias de envejecimiento en el México rural
Objective. To explore the aging experience among men and women older than 60 years, living in rural areas from the states of Guerrero and Morelos, Mexico. Materials and Methods. A qualitative study was conducted in povertystricken, underserved communities with less than 2 500 inhabitants. Semi-structured interviews were applied to collect data. Results. The aging experience is different accordi...
متن کاملConteo de Modelos en la Clase Sintáctica 2mu-3MON
The counting model problem in Boolean formulas is #P-complete, i.e., there is no known deterministic algorithm in the classical computability model (Turing machine) that makes this count in polynomial time. The difficulty persists even imposing more restrictive conditions on the syntactic classes of Boolean formulas. In this paper we present a treatable family within the syntactical class 2μ-3M...
متن کاملLeyes vigentes en México para los programas de cómputo, las bases de datos y su documentación
Mexican customs and practices often influence the rules we must apply in our professional activities, but quite often those customs and practices are far from reality or Mexico laws. The professional life of a developer of computer programs (software), data and information bases has many challenges to overcome, one of which is to remain within the ethics of "ought" and to apply the principle "r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ecosistemas y recursos agropecuarios.(en línea)
سال: 2022
ISSN: ['2007-901X', '2007-9028']
DOI: https://doi.org/10.19136/era.a8nii.2873